Complexity of undecidable formulæ in the rationals and inertial Zsigmondy theorems for elliptic curves

Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (∀∃∀∃)(F = 0) where the ∀-quantifiers run over a total of 8 variables, and where F is a polynomial. This implies that the Σ5-theory of Q is undecidable. We prove that a conjecture about elliptic curves provides an interpretation of Z in Q with quantifier complexity ∀∃, involving only one universally quantified variable. This improves the complexity of defining Z in Q in two ways, and implies that the Σ3-theory, and even the Π2-theory, of Q is undecidable (recall that Hilbert’s Tenth Problem for Q is the question whether the Σ1-theory ofQ is undecidable). The conjecture is related to properties of elliptic divisibility sequences on an elliptic curve and its image under rational 2-descent, namely existence of primitive divisors in suitable residue classes, and we discuss how to prove weakerin-density versions of the conjecture and present some heuristics.